SEQUENTIALLY Sr SIMPLICIAL COMPLEXES AND SEQUENTIALLY S2 GRAPHS
نویسندگان
چکیده
We introduce sequentially Sr modules over a commutative graded ring and sequentially Sr simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying Serre’s condition Sr . In analogy with the sequentially CohenMacaulay property, we show that a simplicial complex is sequentially Sr if and only if its pure i-skeleton is Sr for all i. For r = 2, we provide a more relaxed characterization. As an algebraic criterion, we prove that a simplicial complex is sequentially Sr if and only if the minimal free resolution of the ideal of its Alexander dual is componentwise linear in the first r steps. We apply these results for a graph, i.e., for the simplicial complex of the independent sets of vertices of a graph. We characterize sequentially Sr cycles showing that the only sequentially S2 cycles are odd cycles and, for r ≥ 3, no cycle is sequentially Sr with the exception of cycles of length 3 and 5. We extend certain known results on sequentially Cohen-Macaulay graphs to the case of sequentially Sr graphs. We prove that a bipartite graph is vertex decomposable if and only if it is sequentially S2. We provide some more results on certain graphs which in particular implies that any graph with no chordless even cycle is sequentially S2. Finally, we propose some questions.
منابع مشابه
Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexes
Björner and Wachs generalized the definition of shellability by dropping the assumption of purity; they also introduced the h-triangle, a doubly-indexed generalization of the h-vector which is combinatorially significant for nonpure shellable complexes. Stanley subsequently defined a nonpure simplicial complex to be sequentially Cohen-Macaulay if it satisfies algebraic conditions that generaliz...
متن کاملFinite Filtrations of Modules and Shellable Multicomplexes
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially CohenMacaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
متن کاملErdos-Ko-Rado theorems for simplicial complexes
A recent framework for generalizing the Erdős-KoRado Theorem, due to Holroyd, Spencer, and Talbot, defines the Erdős-Ko-Rado property for a graph in terms of the graph’s independent sets. Since the family of all independent sets of a graph forms a simplicial complex, it is natural to further generalize the Erdős-Ko-Rado property to an arbitrary simplicial complex. An advantage of working in sim...
متن کاملHereditary properties and obstructions of simplicial complexes
In this paper, we discuss the relation between shellability, sequentially CohenMacaulayness, and partitionability. Especially, our main concern is to see the difference of these properties when we require heredity. For a property P, we say a simplicial complex satisfies hereditary-P if the simplicial complex itself and all the restrictions to subsets of its vertex set satisfy the property P, an...
متن کاملVertex Decomposable Graphs and Obstructions to Shellability
Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no chordless 4-cycles are shellable and sequentially Cohen-Macaulay. We use this result to characterize the obstructions to shellability in flag complexes, exte...
متن کامل